Subsumption And Connection Graphs
نویسنده
چکیده
A s u b s u m p t i o n t e s t b a s e d o n t h e p r i n c i p a l i d e a o f K o w a l s k i ' s c o n n e c t i o n g r a p h p r o o f p r o c e d u r e i s d e v e l o p e d . I n c o n t r a s t t o t h e s t a n d a r d t e s t t h i s new t e s t i s s u f f i c i e n t l y e f f i c i e n t t o p e r m i t t h e u n r e s t r i c t e d use o f t h e s u b s u m p t i o n r u l e i n p r a c t i c e . The t e s t i s n o t l i m i t e d t o t h e c o n n e c t i o n g r a p h proof p r o c e d u r e , b u t m o s t n a t u r a l l y embedded i n t o i t . I n t h e l a t t e r c a s e t h e u n r e s t r i c t e d c o m b i n a t i o n o f s u b s u m p t i o n w i t h o t h e r d e l e t i o n r u l e s i s shown t o b e i n c o n s i s t e n t .
منابع مشابه
Some Remarks on Completeness , Connection Graph Resolutionand
A new completeness proof that generalizes the Anderson-Bledsoe excess literal argument is developed for connection-graph resolution. This technique also provides a simpliied completeness proof for semantic resolution. Some observations about subsumption and about link deletion are also made. Link deletion is the basis for connection graphs. Subsumption plays an important role in most resolution...
متن کاملCompleteness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets
In this paper it is shown that R. Kowalski's connection graph proof procedure /Ko75/ terminates with the empty clause for every unit-refutable clause set, provided an exhaustive search strategy is employed. This result holds for unrestricted tautology deletion, whereas subsumption requires certain precautions. The results are shown for an improved version of the connection graph resolution rule...
متن کاملInference Graphs: Combining Natural Deduction and Subsumption Inference in a Concurrent Reasoner
There are very few reasoners which combine natural deduction and subsumption reasoning, and there are none which do so while supporting concurrency. Inference Graphs are a graph-based inference mechanism using an expressive first– order logic, capable of subsumption and natural deduction reasoning using concurrency. Evaluation of concurrency characteristics on a combination natural deduction an...
متن کاملInference Graphs: A New Kind of Hybrid Reasoning System
Hybrid reasoners combine multiple types of reasoning, usually subsumption and Prolog-style resolution. We outline a system which combines natural deduction and subsumption reasoning using Inference Graphs implementing a Logic of Arbitrary and Indefinite Objects.
متن کاملTowards Multi-Strategy Multi-Language-Class Classi cation for Conceptual Graphs
Our main goal is the integration of theorem proving techniques. Logical formulae may be ordered by logical implication. Program speciications are logical formulae and may be in various languages such as conceptual graphs. Languages form a hierarchy ordered by generality of their logical connectives. Classifying formulae requires subsumption methods such as theorem provers. Theorem provers are s...
متن کاملOptimization and Implementation of Subsumption Algorithms for the Description Logic El with Cyclic Tboxes and General Concept Inclusion Axioms
The subsumption problem in the description logic (DL) EL has been shown to be polynomial regardless of whether cyclic or acyclic TBoxes are used. Recently, it was shown that the problem remains tractable even when admitting general concept inclusion (GCI) axioms. Motivated by its nice complexity and sufficient expressiveness for some applications, we propose three decision procedures for comput...
متن کامل